Market-Based Scheduling in Distributed Computing Systems

In verteilten Rechensystemen (bspw. im Cluster und Grid Computing) kann eine Knappheit der zur Verfügung stehenden Ressourcen auftreten. Hier haben Marktmechanismen das Potenzial, Ressourcenbedarf und -angebot durch geeignete Anreizmechanismen zu koordinieren und somit die ökonomische Effizienz des Gesamtsystems zu steigern. Diese Arbeit beschäftigt sich anhand vier spezifischer Anwendungsszenarien mit der Frage, wie Marktmechanismen für verteilte Rechensysteme ausgestaltet sein sollten

A model of preference elicitation: The case of distributed resource allocation

Market mechanisms are deemed promising for distributed resource allocation settings by explicitly involving users into the allocation process. The market considers the users’ and providers’ valuations to generate efficient resource allocations and prices. In theory, valuations are assumed to be known to the user. In practice, however, this is not the case. It is a complex burden for both users and providers to assess their true valuation for a certain combination of resources and services and to efficiently communicate this valuation to the market. This paper contributes to the theory of designing distributed allocation models in that (i) we propose a model for preference elicitation, which allows users and providers to assess their valuations as a function of their resource requirements and strategic considerations, (ii) we show how this model can be encoded within so-called bidding agents which interact with the market on behalf of the user, and (iii) we evaluate our approach in a numerical experiment to illustrate how the bidding agent adapts to the dynamic market situation. As this evaluation shows, the model outperforms technical schedulers and can thus be used for decision support in electronic markets

A Pay-as-Bid Mechanism for Pricing Utility Computing

Encountering the increasing demand for high-performance computational resources in academic as well as commercial organisations, utility computing offers a solution by providing users with on-demand availability of requested computing services. Approaches to the fundamental issue of resource allocation include the use of technical scheduling mechanisms as well as introducing economic ideas into the allocation schemes. Technical scheduling mechanisms are often very simple (such as first-in-first-out) but suffer under the shortcoming to adequately prioritize jobs in times when demand exceeds supply. As empirical studies show, Grids (such as PlanetLab) are frequently characterized by huge excess demand for resources. This is where economic models such as markets come into play. Hitherto, market mechanisms are either (too) simple or too complex for usage in Grids. The contribution of this paper is threefold. Firstly, a mechanism for Grids is proposed, which is still simple but geared up for use in the Grid. Secondly the mechanism is embedded in state-of-the-art Grid middleware Sun N1 Grid Engine 6. Thirdly, it is shown by means of a numerical case study that this mechanism is superior to other commonly used mechanisms

A model of preference elicitation: The case of distributed resource allocation

Market mechanisms are deemed promising for distributed resource allocation settings by explicitly involving users into the allocation process. The market considers the users’ and providers’ valuations to generate efficient resource allocations and prices. In theory, valuations are assumed to be known to the user. In practice, however, this is not the case. It is a complex burden for both users and providers to assess their true valuation for a certain combination of resources and services and to efficiently communicate this valuation to the market. This paper contributes to the theory of designing distributed allocation models in that (i) we propose a model for preference elicitation, which allows users and providers to assess their valuations as a function of their resource requirements and strategic considerations, (ii) we show how this model can be encoded within so-called bidding agents which interact with the market on behalf of the user, and (iii) we evaluate our approach in a numerical experiment to illustrate how the bidding agent adapts to the dynamic market situation. As this evaluation shows, the model outperforms technical schedulers and can thus be used for decision support in electronic markets